package exercises.leetcode.utils;

import java.util.ArrayList;
import java.util.HashSet;

/**
 * <a href="">
 * </a>
 *
 * <p><span color="#87CEEB">描述:</span>
 *
 * @author or2
 * @date 2021年10月29日 时间: 19:29
 */
public class Jianxin_03 {
    public int[] metroRouteDesignI(int[][] lines, int start, int end) {
        var aux = new ArrayList<HashSet<Integer>>(lines.length);
        var startP = new ArrayList<Integer>();
        for (int j = 0, linesLength = lines.length; j < linesLength; j++) {
            int[] line = lines[j];
            var set = new HashSet<Integer>();
            for (int i : line) set.add(i);
            if (set.contains(start)) startP.add(j);
            aux.add(set);
        }

        return new int[]{-1};
    }
}
